Revision of a Derivative-Free Quasi-Newton Method
نویسندگان
چکیده
A derivative-free Quasi-Newton (DFQN) method previously published [J. Greenstadt, Math. Comp., v. 26, 1972, pp. 145—166] has been revised and simplified. The main modification has the effect of keeping all the successive approximants to the Hessian matrix positive-definite. This, coupled with some improvements in the line search, has enhanced the performance of the method considerably. The results of numerical trials on many of the "standard" test functions are displayed, in addition to comparisons with two other methods. These indicate that the present DFQN method is not too far behind that of Gill, Murray and Pitfield, the most efficient one presently known.
منابع مشابه
A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems
In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...
متن کاملDerivative-Free Optimization Via Proximal Point Methods
Derivative-Free Optimization (DFO) examines the challenge of minimizing (or maximizing) a function without explicit use of derivative information. Many standard techniques in DFO are based on using model functions to approximate the objective function, and then applying classic optimization methods on the model function. For example, the details behind adapting steepest descent, conjugate gradi...
متن کاملAn indicator for the switch from derivative-free to derivative-based optimization
In some optimization problems found in applications, the derivatives of the objective function can be computed or approximated but at an expensive cost, and it is desirable to know when to use derivative-free methods (such as direct search, for instance) or derivativebased methods (such as gradient or quasi-Newton methods). Derivative-free methods may achieve a steady initial progress for some ...
متن کاملTwo derivative-free methods for solving underdetermined nonlinear systems of equations
In this paper, two different approaches to solve underdetermined nonlinear system of equations are proposed. In one of them, the derivative-free method defined by La Cruz, Martínez and Raydan for solving square nonlinear systems is modified and extended to cope with the underdetermined case. The other approach is a Quasi-Newton method that uses the Broyden update formula and the globalized line...
متن کاملA derivative-free optimization algorithm based on conditional moments
In this paper we propose a derivative-free optimization algorithm based on conditional moments for finding the maximizer of an objective function. The proposed algorithm does not require calculation or approximation of any order derivative of the objective function. The step size in iteration is determined adaptively according to the local geometrical feature of the objective function and a pre...
متن کامل